An analytic expression approximating the Debye heat capacity function
نویسندگان
چکیده
منابع مشابه
Approximating the Plenoptic Function
The full plenoptic function describes all of the light passing through some volume of space. This information has at least seven dimensions: a ray of light requires five numbers to locate it (a point in space and a direction), plus wavelength and time. Given a digital representation of the plenoptic function, we can reconstruct arbitrary views of a scene. Unfortunately, adequately sampling the ...
متن کاملApproximating the erfinv function
The inverse error function erfinv is a standard component of mathematical libraries, and particularly useful in statistical applications for converting uniform random numbers into Normal random numbers. This chapter presents a new approximation of the erfinv function which is significantly more efficient for GPU execution due to the greatly reduced warp divergence.
متن کاملGalaxy Luminosity Function: A New Analytic Expression
We propose a new analytic approximation for the luminosity function of galaxies. The suggested expression behaves like the Schechter function at the faint end (φ ∼ L) but departs considerably at the bright end (L >> L∗). We argue here that such a behavior may provide a better fit for the current observational data than does the Schechter function. Its practical interest is stressed by consideri...
متن کاملOptimal information for approximating periodic analytic functions
Let Sβ := {z ∈ C : | Im z| < β} be a strip in the complex plane. For fixed integer r ≥ 0 let Hr ∞,β denote the class of 2π-periodic functions f , which are analytic in Sβ and satisfy |f(r)(z)| ≤ 1 in Sβ . Denote by Hr,R ∞,β the subset of functions from Hr ∞,β that are real-valued on the real axis. Given a function f ∈ Hr ∞,β , we try to recover f(ζ) at a fixed point ζ ∈ R by an algorithm A on t...
متن کاملApproximating the Bethe Partition Function
When belief propagation (BP) converges, it does so to a stationary point of the Bethe free energy F , and is often strikingly accurate. However, it may converge only to a local optimum or may not converge at all. An algorithm was recently introduced by Weller and Jebara for attractive binary pairwise MRFs which is guaranteed to return an !-approximation to the global minimum of F in polynomial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIP Advances
سال: 2019
ISSN: 2158-3226
DOI: 10.1063/1.5110279